Hot - Potato Routing Algorithms for Sparse Opti al
نویسندگان
چکیده
منابع مشابه
Routing without Flow Control Hot-Potato Routing Simulation Analysis
This paper presents a simulation analysis of the algorithm presented in “Routing without Flow Control,” by Busch, Herlihy and Wattenhoffer, 2001, [1]. The hot-potato routing algorithm is simulated using Rensselaer’s Optimistic Simulation System. The simulation uses a novel reverse computation approach to efficiently and optimistically parallelize the system simulation. In addition to simulating...
متن کاملNear-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within pol...
متن کاملFlying Hot Potatoes
Optical communication networks and air traffic management systems share the same fundamental routing problem as both optical packets and aircraft must continuously move within the network, while avoiding conflicts. In this paper, we explore the use of hot potato and deflection routing algorithms, which are established routing methods in optical communication networks, in the conflict-free routi...
متن کاملGreedy Õ(C +D) Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit. A hotpotato routing algorithm is greedy if packets are advanced from their sources toward their destinations whenever possible. The dilation D is the longest distance a packet has to travel; the congestion C is the maximum number of packets that traverse any edge. The routing time of a routing-algor...
متن کاملA Study on Distributed Structures
2 Preface In distributed and parallel computing environments, there are many computational problems that require efficient communication and coordination between the processes. For such problems there have been proposed several distributed structures, each designed to solve a particular problem or a class of problems. The distributed structures take into account the particularities of the speci...
متن کامل